// Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
//
//  
//
// Example 1:
//
//
// Input: 5
// Output: 2
// Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
//
//
//  
//
// Example 2:
//
//
// Input: 1
// Output: 0
// Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
//
//
//  
//
// Note:
//
//
// 	The given integer is guaranteed to fit within the range of a 32-bit signed integer.
// 	You could assume no leading zero bit in the integer’s binary representation.
// 	This question is the same as 1009: https://leetcode.com/problems/complement-of-base-10-integer/
//
//


/**
 * @param {number} num
 * @return {number}
 */
var findComplement = function(num) {
    let raw_res=parseInt(num).toString(2);
    let res='';
    for(let i=0;i<raw_res.length;i++){
        if(raw_res[i]=='1'){
            res+='0';
        }else{
            res+='1';
        }
    }
    
    return parseInt(res,2);
};
